Variable delay ripple carry adder with carry chain interrupt detection
نویسندگان
چکیده
Various implementations are known for the efficient implementation of adders. As opposed to traditional optimization techniques a statistical approach using early termination detection is used in this article to obtain efficient implementations for large operands. The completion detection logic is described and the efficiency of the approach is shown and analyzed analytically and through computer simulations. The technique is based on area and routing efficient ripple carry adders, which is are especially desirable properties for very long word length.
منابع مشابه
Performance optimization of Carry Select Adders using Variable Latency design style
This paper presents a Variable Latency (VL) adder. It is introduced to work at a lower time delay than that required by a Ripple Carry Adder (RCA). It proposes a new technique called HOLD LOGIC. The VL-adder design is further modified to overcome the effects of negative bias temperature instability (NBTI). In the CLDC (Carry Length Detection Circuit), more number of components are used and it p...
متن کاملA low power carry select adder with reduced area
A carry-select adder can be implemented by using single ripple carry adder and an add-one circuit [1] instead of using dual ripple-carry adders. This paper proposes a new add-one circuit using the first zero finding circuit and multiplexers to reduce the area and power with no speed penalty. For bit length n = 64, this new carry-select adder requires 38 percent fewer transistors than the dual r...
متن کاملAnalysis and design of CMOS Manchester adders with variable carry-skip
Carry-skip adders compare favorably with other adders for efficient VLSI implementation. Lehman has shown that carry-skip adders with variable-size blocks are faster than adders with constant size blocks. In 1967, Majerski suggested that multi-level implementation of the variable-size carry-skip adders would provide further improvement in speed. Almost two decades later, Oklobdzija and Barnes d...
متن کاملAn Improved Optimization Techniques for Parallel Prefix Adder using FPGA
In this paper, Carry Tree Adders are Proposed. Parallel prefix adders have the best performance in VLSI Design. Parallel prefix adders gives the best performance compared to the Ripple Carry Adder (RCA) and Carry Skip Adder (CSA). Here Delay measurements are done for Kogge-Stone Adder, Sparse Kogge-Stone Adder and Spanning Tree Adder. Speed of Kogge-Stone adder and Sparse Kogge-Stone adder have...
متن کاملA Novel Ripple/Carry Look Ahead Hybrid Carry Select Adder Architecture
In this paper, two general architectures of Carry Select Adder (CSA) have been introduced for high speed addition. These CSA architectures utilize the hybridized structure of Carry Lookahead Adder (CLA) and Ripple Carry Adder (RCA). In these architectures the critical path delay has been reduced by reducing the number of multiplexer stages. The proposed designs are compared with regular CSA bas...
متن کامل